% This file was created with JabRef 2.7b.
% Encoding: UTF-8

@ARTICLE{Ostergard.02,
  author = {P. {\"Osterg\aa rd}},
  title = {A fast algorithm for the maximum clique problem},
  journal = {Discrete Applied Mathematics},
  year = {2002},
  volume = {120},
  pages = {197--207},
  number = {1--3}
}

@ARTICLE{Ostergard.01,
  author = {P. \"Ostergaard},
  title = {A new algorithm for the maximum weight clique problem},
  journal = {Nordic Journal of Computing},
  year = {2001},
  volume = {8},
  pages = {424--436},
  number = {4}
}

@INPROCEEDINGS{Arora.Safra.92,
  author = {S. Arora and S. Safra},
  title = {Probabilistic checking of proofs; a new characterization of {NP}},
  booktitle = {Proceedings 33rd IEEE FOCS},
  year = {1992},
  pages = {2--3}
}

@ARTICLE{Atamturk200040,
  author = {A. Atamt\"urk and G. L. Nemhauser and M. W. P. Savelsbergh},
  title = {Conflict graphs in solving integer programming problems },
  journal = {European Journal of Operational Research },
  year = {2000},
  volume = {121},
  pages = {40 - 55},
  number = {1},
  doi = {http://dx.doi.org/10.1016/S0377-2217(99)00015-6},
  issn = {0377-2217},
  keywords = {Conflict graphs},
  url = {http://www.sciencedirect.com/science/article/pii/S0377221799000156}
}

@ARTICLE{Balas.Padberg.76,
  author = {E. Balas and M. Padberg},
  title = {Set partitioning: a survey},
  journal = {SIAM Review},
  year = {1976},
  volume = {18},
  pages = {710--760}
}

@ARTICLE{Balas.Xue.96,
  author = {E. Balas and J. Xue},
  title = {Weighted and Unweighted Maximum Clique Algorithms with Upper Bounds
	from Fractional Coloring},
  journal = {Algorithmica},
  year = {1996},
  volume = {15},
  pages = {397--412}
}

@INPROCEEDINGS{Bomze99themaximum,
  author = {I. M. Bomze and M. Budinich and P. M. Pardalos and M. Pelillo},
  title = {The Maximum Clique Problem},
  booktitle = {Handbook of Combinatorial Optimization},
  year = {1999},
  pages = {1--74},
  publisher = {Kluwer Academic Publishers}
}

@ARTICLE{born-weis,
  author = {R. Bornd\"orfer and R. Weismantel},
  title = {Set packing relaxations of some integer programs},
  journal = {Mathematical Programming},
  year = {2000},
  volume = {88},
  pages = {425-450},
  number = {3},
  doi = {10.1007/PL00011381},
  issn = {0025-5610},
  keywords = {Key words: set packing – polyhedral combinatorics – cutting planes
	– integer programming; Mathematics Subject Classification (2000):
	90C10},
  language = {English},
  publisher = {Springer-Verlag},
  url = {http://dx.doi.org/10.1007/PL00011381}
}

@ARTICLE{Brelaz.79,
  author = {D.~Br{\'e}laz},
  title = {New methods to color the vertices of a graph},
  journal = {Communications of the ACM},
  year = {1979},
  volume = {22},
  pages = {251--256},
  number = {4}
}

@PHDTHESIS{ButenkoThesis,
  author = {S. Butenko},
  title = {Maximum independent set and related problems, with applications.},
  school = {University of Florida, USA},
  year = {2003},
  owner = {ik},
  timestamp = {2014.05.15}
}

@ARTICLE{Campelo.Campos.Correa.08,
  author = {M. Camp{\^e}lo and V. Campos and R. Corr{\^e}a},
  title = {On the Asymmetric Representatives Formulation for the Vertex Coloring
	Problem},
  journal = {Discrete Applied Mathematics},
  year = {2008},
  volume = {156},
  pages = {1097--1111},
  number = {7},
  optnote = {DOI }
}

@ARTICLE{CampeloC10,
  author = {M. B. Camp{\^e}lo and R. C. Corr{\^e}a},
  title = {A Combined Parallel Lagrangian Decomposition and Cutting-Plane Generation
	for Maximum Stable Set Problems},
  journal = {Electronic Notes in Discrete Mathematics},
  year = {2010},
  volume = {36},
  pages = {503-510},
  bibsource = {DBLP, http://dblp.uni-trier.de},
  ee = {http://dx.doi.org/10.1016/j.endm.2010.05.064}
}

@ARTICLE{Carraghan.Pardalos.90,
  author = {R. Carraghan and P.M. Pardalos},
  title = {An exact algorithm for the maximum clique problem},
  journal = {Operations Research Letters},
  year = {1990},
  volume = {9},
  pages = {375--382}
}

@ARTICLE{raey,
  author = {I. Dukanovic and F. Rendl},
  title = {Semidefinite programming relaxations for graph coloring and maximal
	clique problems},
  journal = {Mathematical Programming},
  year = {2007},
  volume = {109},
  pages = {345-365},
  number = {2-3},
  doi = {10.1007/s10107-006-0026-z},
  issn = {0025-5610},
  keywords = {Lovász theta number; Chromatic number; Clique number; Cutting planes},
  language = {English},
  publisher = {Springer-Verlag},
  url = {http://dx.doi.org/10.1007/s10107-006-0026-z}
}

@BOOK{G-J,
  title = {Computers and {I}ntractability: {A} {G}uide to the {T}heory of {NP}-{C}ompleteness},
  publisher = {Freeman and {C}ompany},
  year = {1979},
  author = {M. {Garey} and D. {Johnson}},
  address = {San Francisco}
}

@ARTICLE{Gruber,
  author = {G. Gruber and F. Rendl},
  title = {Computational Experience with Stable Set Relaxations},
  journal = {SIAM J. on Optimization},
  year = {2002},
  volume = {13},
  pages = {1014--1028},
  number = {4},
  month = oct,
  acmid = {643440},
  address = {Philadelphia, PA, USA},
  doi = {10.1137/S1052623401394092},
  issn = {1052-6234},
  issue_date = {2002},
  keywords = {semidefinite programming, stable set problem, theta function},
  numpages = {15},
  publisher = {Society for Industrial and Applied Mathematics},
  url = {http://dx.doi.org/10.1137/S1052623401394092}
}

@INCOLLECTION{Karp.72,
  author = {R. Karp},
  title = {Reducibility among Combinatorial Problems},
  booktitle = {Complexity of Computer Computations},
  publisher = {Plenum},
  year = {1972},
  editor = {R. E. Miller and J. W. Thatcher},
  pages = {85--103},
  optaddress = {New York}
}

@ARTICLE{Konc.Janezic.07,
  author = {J. Konc and D. Jane\v{z}i\v{c}},
  title = {An improved branch and bound algorithm for the maximum clique problem},
  journal = {MATCH Communications in Mathematical and in Computer Chemistry},
  year = {2007},
  volume = {58},
  pages = {569--590}
}

@ARTICLE{LovaszPlummer86,
  author = {Lov{\'a}sz, L. and Plummer, M.D.},
  title = {Matching Theory},
  journal = {Annals of Discrete Mathematics},
  year = {1986},
  volume = {33},
  pages = {544}
}

@INCOLLECTION{ManninoSassano96,
  author = {C. Mannino and A. Sassano},
  title = {Edge projection and the maximum cardinality stable set problem},
  booktitle = {DIMACS Ser. Discrete Math. Theoret. Comput. Sci.},
  volume = {26},
  pages = {249--261},
  optyear = {1996}
}

@ARTICLE{Pardalos,
  author = {S. Rebennack and M. Oswald and D. O. Theis and H. Seitz and G. Reinelt
	and P. M. Pardalos},
  title = {A Branch and Cut solver for the maximum stable set problem},
  journal = {J Comb Optim},
  year = {2011},
  volume = {21},
  pages = {434--457}
}

@ARTICLE{Rossi.Smriglio.01,
  author = {F. Rossi and S. Smriglio},
  title = {A branch-and-cut algorithm for the maximum cardinality stable set
	problem},
  journal = {Operations Research Letters},
  year = {2001},
  volume = {28},
  pages = {63--74}
}

@ARTICLE{Segundo.12,
  author = {P. S.~Segundo},
  title = {A new DSATUR-based algorithm for exact vertex coloring},
  journal = {Computers \& Operations Research},
  year = {2012},
  volume = {39},
  pages = {1724--1733}
}

@INBOOK{Segundo.Rodriguez-Losada.Rossi.08,
  chapter = {Recent Developments in Bit-Parallel Algorithms},
  pages = {348--368},
  title = {Tools in Artificial Intelligence},
  publisher = {InTech},
  year = {2008},
  editor = {P. Fritzsche},
  author = {P. S. Segundo and D. Rodriguez-Losada and C. Rossi},
  optnote = {Available from {\tt http://www.intechopen.com/books/tools\_in\_artificial\_intelligence/recent\_developments\_in\_bit-parallel\_algorithms}}
}

@ARTICLE{Segundo.Losada.Jimenez.11,
  author = {P. S.~Segundo and D. Rodríguez-Losada and A. Jiménez},
  title = {An exact bit-parallel algorithm for the maximum clique problem},
  journal = {Comp. \& Op. Research},
  year = {2011},
  volume = {38},
  pages = {571--581}
}

@INPROCEEDINGS{Sewell.96,
  author = {E. Sewell},
  title = {An improved algorithm for exact graph coloring},
  booktitle = {Cliques, coloring, and satisfiability. Proceedings of the second
	DIMACS implementation challenge},
  year = {1996},
  editor = {M. A. Trick and D. S. Johnson},
  volume = {26},
  series = {American Mathematical Society},
  pages = {359--373}
}

@ARTICLE{Sewell.98,
  author = {E. Sewell},
  title = {A branch and bound algorithm for the stability number of a sparse
	graph},
  journal = {INFORMS Journal on Computing},
  year = {1998},
  volume = {10},
  pages = {438--447},
  number = {4}
}

@ARTICLE{Tomita.Kameda.07,
  author = {E. Tomita and T. Kameda},
  title = {An efficient branch-and-bound algorithm for finding a maximum clique
	with computational experiments},
  journal = {Journal of Global Optimization},
  year = {2007},
  volume = {37},
  pages = {95--111},
  number = {1}
}

@INPROCEEDINGS{Tomita.Sutani.Higashi.Takahashi.Wakatsuki.10,
  author = {E. Tomita and Y. Sutani and T. Higashi and S. Takahashi and M. Wakatsuki},
  title = {A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum
	Clique},
  booktitle = {Proc. of {WALCOM}: Algorithms and Computation},
  year = {2010},
  number = {5942},
  series = {LNCS},
  pages = {191--203},
  publisher = {Springer}
}

@INBOOK{Trick.96-clique,
  pages = {653--657},
  title = {Second {DIMACS} {C}hallenge test problems},
  publisher = {AMS},
  year = {1996},
  author = {M.~Trick},
  series = {DIMACS Series in Discrete Math. and Th. Comp. Science},
  note = {Also available at {\tt ftp://dimacs.rutgers.edu/pub/challenge/graph/benchmarks/clique}},
  altchapter = {Chapter},
  alteditor = {Editor}
}

@PHDTHESIS{Warrier2003,
  author = {D. Warrier},
  title = {A branch, price, and cut approach to solving the maximum weighted
	independent set problem.},
  school = {Texas A\&M University},
  year = {2003},
  owner = {ik},
  timestamp = {2014.05.15}
}

@ARTICLE{Warrier2005,
  author = {D. Warrier and W. E. Wilhelm and J. S. Warren and I. V. Hicks},
  title = {A branch-and-price approach for the maximum weight independent set
	problem},
  journal = {Networks},
  year = {2005},
  volume = {46},
  pages = {198-209},
  number = {4},
  bibsource = {DBLP, http://dblp.uni-trier.de},
  ee = {http://dx.doi.org/10.1002/net.20088}
}

@ARTICLE{XavierCampelo11,
  author = {A. S. Xavier and M. B. Camp{\^e}lo},
  title = {A New Facet Generating Procedure for the Stable Set Polytope},
  journal = {Electronic Notes in Discrete Mathematics},
  year = {2011},
  volume = {37},
  pages = {183-188}
}

